منابع مشابه
On common neighborhood graphs II
Let G be a simple graph with vertex set V (G). The common neighborhood graph or congraph of G, denoted by con(G), is a graph with vertex set V (G), in which two vertices are adjacent if and only if they have at least one common neighbor in G. We compute the congraphs of some composite graphs. Using these results, the congraphs of several special graphs are determined.
متن کاملOn closed graphs, II
A graph is closed when its vertices have a labeling by [n] with a certain property first discovered in the study of binomial edge ideals. In this article, we explore various aspects of closed graphs, including the number of closed labelings and clustering coefficients.
متن کاملGraphs without repeated cycle lengths
In 1975, P. Erdös proposed the problem of determining the maximum number f(n) of edges in a graph of n vertices in which any two cycles are of different lengths. In this paper, it is proved that f(n) ≥ n + 36t for t = 1260r + 169 (r ≥ 1) and n ≥ 540t2 + 175811 2 t + 7989 2 . Consequently, lim infn→∞ f(n)−n √ n ≥ √
متن کاملRepeated communication and Ramsey graphs
We study the savings afforded by repeated use in two zero-error communication problems. We show that for some random sources, communicating one instance requires arbitrarily-many bits, but communicating multiple instances requires roughly one bit per instance. We also exhibit sources where the number of bits required for a single instance is comparable to the source’s size, but two instances re...
متن کاملSwarming on Random Graphs II
We consider an individual-based model where agents interact over a random network via firstorder dynamics that involve both attraction and repulsion. In the case of all-to-all coupling of agents in Rd this system has a lowest energy state in which an equal number of agents occupy the vertices of the d-dimensional simplex. The purpose of this paper is to study the behavior of this model when the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1971
ISSN: 0095-8956
DOI: 10.1016/0095-8956(71)90013-x